Careful synchronization of partial deterministic finite automata

We approach the task of computing a carefully synchronizing word minimum length for given partial deterministic automaton, encoding problem as an instance SAT and invoking solver. Our experiments demonstrate that this gives satisfactory results automata with up to 100 states even if very modest computational resources are used. compare our ones obtained by first author exact synchronization, which is another version synchronization studied in literature, draw some theoretical conclusions.